A Fair Mechanism for Recurrent Multi-unit Auctions
نویسندگان
چکیده
Auctions are a good tool for dealing with resource allocation in multi-agent environments. When the resources are either renewable or perishable resources, a repeated auction mechanism is needed, in what is known as recurrent auctions. However, several problems arise with this kind of auction, namely, the resource waste problem, the bidder drop problem, and the asymmetric balance of negotiation power. In this paper we present different mechanisms to deal with these issues. We have evaluated the mechanisms in a network bandwidth allocation scenario, and the results show that the proposed mechanisms achieve higher benefits for the auctioneer, while also providing a fairer behavior.
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملContext-Based Search in Software Development
Session 1A: Auctions, Mechanism Design and Trust 158 Almost-‐truthful Mechanisms for Fair Social Choice Functions Julien Lesca and Patrice Perny 338 Multi-‐unit Auctions with a Stochastic Number of Asymmetric Bidders Ioannis Vetsikas, Sebastian Stein and Nicholas R. Jennings 570 Multi-‐unit Double Auction under Group Buying Dengji Zhao, Dongmo Zhang and Laurent Perrussel 253 A Protocol Based...
متن کاملHonor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the colluders, characterize the optimal collusion and show it can easily be computed in polynomial time. We then analyze the colluders’ coalition from a cooperative game theoretic perspective. We show that the collusion game is ...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008